Semantic Schema Matching for String Attribute with Word Vectors and its Evaluation
نویسندگان
چکیده
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملdesigning and validating a textbook evaluation questionnaire for reading comprehension ii and exploring its relationship with achievement
در هر برنامه آموزشی، مهم ترین فاکتور موثر بر موفقیت دانش آموزان کتاب درسی است (مک دونو و شاو 2003). در حقیقت ، کتاب قلب آموزش زبان انگلیسی است( شلدن 1988). به دلیل اهمیت والای کتاب به عنوان عنصر ضروری کلاس های آموزش زبان ، کتب باید به دقت ارزیابی و انتخاب شده تا از هرگونه تاثیر منفی بر دانش آموزان جلوگیری شود( لیتز). این تحقیق با طراحی پرسش نامه ارزیابی کتاب که فرصت ارزیابی معتبر را به اساتید د...
15 صفحه اولan improved semantic schema matching approach
schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...
متن کاملSemantic Schema Matching
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic schema matching is based on the two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (con...
متن کاملInteractive Schema Matching With Semantic Functions
Experience suggests that fully automated schema matching is infeasible, especially when n-to-m matches involving semantic functions are required. It is therefore advisable for a matching algorithm not only to do as much as possible automatically, but also to accurately identify positions where user input is necessary. Our matching algorithm combines several existing approaches with a new emphas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networked and Distributed Computing
سال: 2019
ISSN: 2211-7946
DOI: 10.2991/ijndc.k.190710.001